Declarative Foreign Function Binding Through Generic Programming

نویسندگان

  • Jeremy Yallop
  • David Sheets
  • Anil Madhavapeddy
چکیده

Foreign function interfaces are typically organised monolithically, tying together the specification of each foreign function with the mechanism used to make the function available in the host language. This leads to inflexibile systems, where switching from one binding mechanism to another (say from dynamic binding to static code generation) often requires changing tools and rewriting large portions of code. In contrast, approaching the design of a foreign function interface as a generic programming problem allows foreign function specifications to be written declaratively, with easy switching between a wide variety of binding mechanisms — static and dynamic, synchronous and asynchronous, etc. — with no changes to the specifications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modular foreign function interface

Foreign function interfaces are typically organised monolithically, tying together the specification of each foreign function with the mechanism used to make the function available in the host language. This leads to inflexible systems, where switching from one binding mechanism to another (say from dynamic binding to static code generation) often requires changing tools and rewriting large por...

متن کامل

An extensible declarative classification framework and its efficient implementation (Draft)

We design a generic declarative framework for classification of objects in imperative languages, which allows for arbitrary extensions through callbacks to procedural code. Our work is inspired by some more general tools for knowledge representation, such as prioritized extended datalog programs ([9], [6]). We also outline an efficient and scalable algorithm for evaluating our programs, which i...

متن کامل

Generic and Declarative Approaches to Data Cleaning: Some Recent Developments

Data assessment and data cleaning tasks have traditionally been addressed through procedural solutions. Most of the time, those solutions have been applicable to specific problems and domains. In the last few years we have seen the emergence of more generic solutions; and also of declarative and rule-based specifications of the intended solutions of data cleaning processes. In this chapter we r...

متن کامل

Generic and Declarative Approaches to Data Quality Management

Data quality assessment and data cleaning tasks have traditionally been addressed through procedural solutions. Most of the time, those solutions have been applicable to specific problems and domains. In the last few years we have seen the emergence of more generic solutions; and also of declarative and rule-based specifications of the intended solutions of data cleaning processes. In this chap...

متن کامل

On Factorization as Bijection to Finite Sequences

We describe mechanisms to emulate multiplicative properties of prime numbers by connecting them to computationally simpler representations involving bijections from natural numbers to sequences and multisets of natural numbers. Through a generic framework, we model interesting properties of a canonical representation of factorization and its simpler equivalents. Among their shared properties, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016